#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
	int minSubArrayLen(int s, vector<int>& nums) {
		int sum = 0;
		int result = INT32_MAX;
		int subLen = 0;
		int i = 0;
		for(int j = 0;j < nums.size();j++){
			sum += nums[j];
			while(sum >= s){
				subLen = (j - i + 1);
				result = subLen < result ? subLen : result;
				sum -= nums[i++];
			}
		}
		return result == INT32_MAX?0:result;
		
	}
};


int main(){
	
	
}
